package com.zzg.algorithm.prim.entity;

/**
 * @Author zhengzg
 * @Date 2022-10-10
 * @Version v1.0
 * 图
 */
public class MGraph {
    // 表示图中的结点个数
    public int verxs;

    // 存放结点数据
    public char[] data;

    // 存放边，就是邻接矩阵
    public int[][] weight;

    public MGraph(int verxs) {
        this.verxs = verxs;
        this.data = new char[verxs];
        this.weight = new int[verxs][verxs];
    }
}
